Lecture 11 — March 22 , 2012

Before presenting any integer data structures, we present some models for computations with integers (both to precisely state what we are looking for, and as a framework to prove lower bounds). In each model, memory is arranged as a collection of words of some size (and potentially a small amount of working memory), and a fixed cost is charged for each operation. We also always make the fixed universe assumption. We assume that each data structure needs to answer queries with respect to a fixed set of w-bit integers U = {0, 1, 2, . . . , u − 1}.